The Structure of Conjugacy Closed Loops
نویسنده
چکیده
We study structure theorems for the conjugacy closed (CC-) loops, a specific variety of G-loops (loops isomorphic to all their loop isotopes). These theorems give a description all such loops of small order. For example, if p and q are primes, p < q, and q − 1 is not divisible by p, then the only CC-loop of order pq is the cyclic group of order pq. For any prime q > 2, there is exactly one non-group CC-loop in order 2q, and there are exactly three in order q2. We also derive a number of equations valid in all CC-loops. By contrast, every equation valid in all G-loops is valid in all loops.
منابع مشابه
Structural Interactions of Conjugacy Closed Loops
We study conjugacy closed loops by means of their multiplication groups. Let Q be a conjugacy closed loop, N its nucleus, A the associator subloop, and L and R the left and right multiplication groups, respectively. Put M = {a ∈ Q; La ∈ R}. We prove that the cosets of A agree with orbits of [L,R], that Q/M ∼= (InnQ)/L1 and that one can define an abelian group on Q/N × Mlt1. We also explain why ...
متن کاملPower-associative, Conjugacy Closed Loops
We study conjugacy closed loops (CC-loops) and power-associative CC-loops (PACC-loops). If Q is a PACC-loop with nucleus N , then Q/N is an abelian group of exponent 12; if in addition Q is finite, then |Q| is divisible by 16 or by 27. There are eight nonassociative PACC-loops of order 16, three of which are not extra loops. There are eight nonassociative PACC-loops of order 27, four of which h...
متن کاملOn Left Conjugacy Closed Loops with a Nucleus of Index Two
A loop Q is said to be left conjugacy closed (LCC) if the left translations form a set of permutations that is closed under conjugation. Loops in which the left and right nuclei coincide and are of index 2 are necesarilly LCC, and they are constructed in the paper explicitly. LCC loops Q with the right nucleus G of index 2 offer a larger diversity. A sample of results: if Z(G) = 1, then Q is al...
متن کاملCode Loops in Both Parities
We present equivalent definitions of code loops in any characteristic p 6= 0. The most natural definition is via combinatorial polarization, but we also show how to realize code loops by linear codes and as a class of symplectic conjugacy closed loops. For p odd, it is possible to define code loops via characteristic trilinear forms. Related concepts are discussed.
متن کاملDiassociativity in Conjugacy Closed Loops
Let Q be a conjugacy closed loop, and N(Q) its nucleus. Then Z(N(Q)) contains all associators of elements of Q. If in addition Q is diassociative (i.e., an extra loop), then all these associators have order 2. If Q is power-associative and |Q| is finite and relatively prime to 6, then Q is a group. If Q is a finite non-associative extra loop, then 16 | |Q|.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996